A simple entropy-based algorithm for planar point location
نویسندگان
چکیده
منابع مشابه
A cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملA Entropy, Triangulation, and Point Location in Planar Subdivisions
A data structure is presented for point location in connected planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that is within a constant factor of optimal. More specifically, an algorithm is presented that preprocesses a connected planar subdivision G of size n and a query distribution D to produce a point location data stru...
متن کاملAdaptive Planar Point Location
We present a self-adjusting point location structure for convex subdivisions. Let n be the number of vertices in a convex subdivision S. Our structure for S uses O(n) space and processes any online query sequence σ in O(n+ OPT) time, where OPT is the minimum time required by any linear decision tree for answering point location queries in S to process σ. The O(n + OPT) time bound includes the p...
متن کاملDistance-Sensitive Planar Point Location
Let S be a connected planar polygonal subdivision with n edges that we want to preprocess for point-location queries, and where we are given the probability γi that the query point lies in a polygon Pi of S. We show how to preprocess S such that the query time for a point p ∈ Pi depends on γi and, in addition, on the distance from p to the boundary of Pi—the further away from the boundary, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2007
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1240233.1240240